cycle double cover conjecture造句

• Therefore, the circular embedding conjecture is clearly at least as strong as the cycle double cover conjecture.
• Therefore, if the cycle double cover conjecture is true, every biconnected graph has a circular embedding.
• Unfortunately, it is not possible to prove the cycle double cover conjecture using a finite set of reducible configurations.
• Observes that, in any potential minimal counterexample to the cycle double cover conjecture, all vertices must have three or more incident edges.
• That is, the cycle double cover conjecture is equivalent to the circular embedding conjecture, even though a cycle double cover and a circular embedding are not always the same thing.
• It is an unsolved problem, posed by George Szekeres and Paul Seymour and known as the "'cycle double cover conjecture "', whether every bridgeless graph has a cycle double cover.
• A stronger type of embedding than a circular embedding is a " polyhedral embedding ", an embedding of a graph on a surface in such a way that every face is a simple cycle and every two faces that intersect do so in either a single vertex or a single edge . ( In the case of a cubic graph, this can be simplified to a requirement that every two faces that intersect do so in a single edge . ) Thus, in view of the reduction of the cycle double cover conjecture to snarks, it is of interest to investigate polyhedral embeddings of snarks.